parser - определение. Что такое parser
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

Что (кто) такое parser - определение

PROCESS OF ANALYZING A STRING OF SYMBOLS, EITHER IN NATURAL LANGUAGE, COMPUTER LANGUAGES OR DATA STRUCTURES, CONFORMING TO THE RULES OF A FORMAL GRAMMAR
Syntax analysis; Syntactical analysis; Parsers; Parseable; Parsing (human languages); Syntactic Analysis; Syntactic analysis; Parser 3; Parser; Parse; Syntactic parsing; Grammar parser; Parsable; Natural language parsing; Parsed; HTML parser; Natural language parser; List of parser development software; Parsing algorithms; Parsing algorithm; English parser; SyntaxNet; Parsing of natural language; Lookahead (parsing); Parsers for natural languages; Graph parsing; Mechanical layout
  • Flow of data in a typical parser
  •  url=https://archive.org/details/cprogramminglang00bria }} (Appendix A.13 "Grammar", p.193 ff)</ref> ''Bottom:'' a parser has digested the tokens "<syntaxhighlight lang="c" inline>int v;main(){</syntaxhighlight>" and is about choose a rule to derive ''Stmt''. Looking only at the first lookahead token "<syntaxhighlight lang="c" inline>v</syntaxhighlight>", it cannot decide which of both alternatives for ''Stmt'' to choose; the latter requires peeking at the second token.
Найдено результатов: 378
Parser         
·noun One who parses.
parser         
<language> An algorithm or program to determine the syntactic structure of a sentence or string of symbols in some language. A parser normally takes as input a sequence of tokens output by a lexical analyser. It may produce some kind of abstract syntax tree as output. One of the best known parser generators is yacc. (1997-07-21)
Simple LR parser         
TYPE OF LR PARSER WITH SMALL PARSE TABLES AND A RELATIVELY SIMPLE PARSER GENERATOR ALGORITHM
SLR parser; SLR(1)
In computer science, a Simple LR or SLR parser is a type of LR parser with small parse tables and a relatively simple parser generator algorithm. As with other types of LR(1) parser, an SLR parser is quite efficient at finding the single correct bottom-up parse in a single left-to-right scan over the input stream, without guesswork or backtracking.
Parser combinator         
Parser combinators; Combinatory parsing; Parser Combinator; Combinator parser; Parser Combinators
In computer programming, a parser combinator is a higher-order function that accepts several parsers as input and returns a new parser as its output. In this context, a parser is a function accepting strings as input and returning some structure as output, typically a parse tree or a set of indices representing locations in the string where parsing stopped successfully.
Parsing         
·p.pr. & ·vb.n. of Parse.
parsing         
Parsing         
Parsing, syntax analysis, or syntactic analysis is the process of analyzing a string of symbols, either in natural language, computer languages or data structures, conforming to the rules of a formal grammar. The term parsing comes from Latin pars (orationis), meaning part (of speech).
Parsed         
·Impf & ·p.p. of Parse.
Earley parser         
AN ALGORITHM FOR PARSING STRINGS THAT BELONG TO A GIVEN CONTEXT-FREE LANGUAGE
Earley Parser; Early algorithm; Earley Algorithm; Early Parser; Earley algorithm; Early parser; Early Algorithm; Earley's algorithm; Earley parsing; Parse forest
In computer science, the Earley parser is an algorithm for parsing strings that belong to a given context-free language, though (depending on the variant) it may suffer problems with certain nullable grammars. The algorithm, named after its inventor, Jay Earley, is a chart parser that uses dynamic programming; it is mainly used for parsing in computational linguistics.
LR parser         
  • Bottom-Up Parser at step 6
  • Bottom-up parse tree built in numbered steps
TYPE OF PARSER
LR(0) parser; LR parsers; Lr parser; LR(0); LR parsing; LR Parser; Shift-reduce conflict; LR grammar; LR(1) grammar; LR(k) grammar; LR(k)
In computer science, LR parsers are a type of bottom-up parser that analyse deterministic context-free languages in linear time. There are several variants of LR parsers: SLR parsers, LALR parsers, Canonical LR(1) parsers, Minimal LR(1) parsers, and GLR parsers.

Википедия

Parsing

Parsing, syntax analysis, or syntactic analysis is the process of analyzing a string of symbols, either in natural language, computer languages or data structures, conforming to the rules of a formal grammar. The term parsing comes from Latin pars (orationis), meaning part (of speech).

The term has slightly different meanings in different branches of linguistics and computer science. Traditional sentence parsing is often performed as a method of understanding the exact meaning of a sentence or word, sometimes with the aid of devices such as sentence diagrams. It usually emphasizes the importance of grammatical divisions such as subject and predicate.

Within computational linguistics the term is used to refer to the formal analysis by a computer of a sentence or other string of words into its constituents, resulting in a parse tree showing their syntactic relation to each other, which may also contain semantic and other information (p-values). Some parsing algorithms may generate a parse forest or list of parse trees for a syntactically ambiguous input.

The term is also used in psycholinguistics when describing language comprehension. In this context, parsing refers to the way that human beings analyze a sentence or phrase (in spoken language or text) "in terms of grammatical constituents, identifying the parts of speech, syntactic relations, etc." This term is especially common when discussing which linguistic cues help speakers interpret garden-path sentences.

Within computer science, the term is used in the analysis of computer languages, referring to the syntactic analysis of the input code into its component parts in order to facilitate the writing of compilers and interpreters. The term may also be used to describe a split or separation.